{
 "cells": [
  {
   "cell_type": "markdown",
   "id": "3540b264-f712-49a7-bee1-2e6dcd722e09",
   "metadata": {},
   "source": [
    "https://leetcode.com/problems/rotate-list/\n",
    "\n",
    "\n",
    "Runtime: 32 ms, faster than 91.94% of Python3 online submissions for Rotate List.\n",
    "Memory Usage: 14.4 MB, less than 28.15% of Python3 online submissions for Rotate List.\n",
    "\n",
    "\n",
    "```python\n",
    "# Definition for singly-linked list.\n",
    "# class ListNode:\n",
    "#     def __init__(self, val=0, next=None):\n",
    "#         self.val = val\n",
    "#         self.next = next\n",
    "class Solution:\n",
    "    def rotateRight(self, head: ListNode, k: int) -> ListNode:\n",
    "        \"\"\"\n",
    "        #7:15\n",
    "        l = []\n",
    "        node = head\n",
    "        while node != None:\n",
    "            l.append(node)\n",
    "            node = node.next\n",
    "            \n",
    "        if len(l) == 0:\n",
    "            return None\n",
    "        \n",
    "        index = k % len(l)\n",
    "        print(index)\n",
    "        \n",
    "        new_l = l[index:] + l[:index]\n",
    "        for i, node in enumerate(new_l):\n",
    "            if i < len(new_l) - 1:\n",
    "                node.next = new_l[i + 1]\n",
    "            else:\n",
    "                node.next = None\n",
    "        return new_l[0]\n",
    "        #7:22\n",
    "        #wrong\n",
    "        \"\"\"\n",
    "        # another day\n",
    "        # 8:44\n",
    "        l = []\n",
    "        node = head\n",
    "        while node != None:\n",
    "            l.append(node)\n",
    "            node = node.next\n",
    "            \n",
    "        if len(l) == 0:\n",
    "            return None\n",
    "        \n",
    "        k = k % len(l)\n",
    "        i = 0\n",
    "        while i < k:\n",
    "            l = l[-1:] + l[:-1]\n",
    "            i += 1\n",
    "        \n",
    "        for i, node in enumerate(l):\n",
    "            if i < len(l) - 1:\n",
    "                node.next = l[i + 1]\n",
    "            else:\n",
    "                node.next = None\n",
    "        return l[0]\n",
    "        # 8:47\n",
    "```"
   ]
  },
  {
   "cell_type": "code",
   "execution_count": null,
   "id": "f09ba3ee-edd9-4c1b-bf84-ca096e686151",
   "metadata": {},
   "outputs": [],
   "source": []
  }
 ],
 "metadata": {
  "kernelspec": {
   "display_name": "Python 3",
   "language": "python",
   "name": "python3"
  },
  "language_info": {
   "codemirror_mode": {
    "name": "ipython",
    "version": 3
   },
   "file_extension": ".py",
   "mimetype": "text/x-python",
   "name": "python",
   "nbconvert_exporter": "python",
   "pygments_lexer": "ipython3",
   "version": "3.8.6"
  }
 },
 "nbformat": 4,
 "nbformat_minor": 5
}